- complete subset
- мат.полное подмножество
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Complete metric space — Cauchy completion redirects here. For the use in category theory, see Karoubi envelope. In mathematical analysis, a metric space M is called complete (or Cauchy) if every Cauchy sequence of points in M has a limit that is also in M or,… … Wikipedia
Subset — Pays d’origine États Unis Genre musical Rock Années d activité 1999 … Wikipédia en Français
Complete Boolean algebra — This article is about a type of mathematical structure. For complete sets of Boolean operators, see Functional completeness. In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound) … Wikipedia
Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 … Wikipedia
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
Complete partial order — In mathematics, directed complete partial orders and ω complete partial orders (abbreviated to dcpo, ωcpo or sometimes just cpo) are special classes of partially ordered sets, characterized by particular completeness properties. Complete partial… … Wikipedia
Complete measure — In mathematics, a complete measure (or, more precisely, a complete measure space) is a measure space in which every subset of every null set is measurable (having measure zero). More formally, (X, Σ, μ) is complete if and only if… … Wikipedia
Complete homogeneous symmetric polynomial — In mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression… … Wikipedia
complete — completable, adj. completedness, n. completely, adv. completeness, n. completer, n. completive, adj. completively, adv. /keuhm pleet /, adj., v., completed, completing. adj … Universalium
Complete theory — In mathematical logic, a theory is complete if it is a maximal consistent set of sentences, i.e., if it is consistent, and none of its proper extensions is consistent. For theories in logics which contain classical propositional logic, this is… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia